منابع مشابه
Parallelizing the Dual Simplex Method Parallelizing the Dual Simplex Method
We study the parallelization of the steepest-edge version of the dual simplex algorithm. Three different parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on ...
متن کاملTesting of Several Recent Modifications to Arps Land Surface Model
1. INTRODUCTION Deardorff (1978, D78 henceforth) showed that a two-layered force-restore scheme is superior to bulk scheme in describing the surface soil moisture content because it contains the mechanism by which a deeper soil layer can influence the thin surface layer. This gives the flexibility and advantages in superficial soil moisture prediction especially when there are precipitation and...
متن کامل2 the Simplex Method
Linear programming has many important practical applications, and has also given rise to a wide body of theory. See Section 50.9 for recommended sources. Here we consider the linear programming problem in the form of maximizing a linear function of d variables subject to n linear inequalities. We focus on the relationship of the problem to computational geometry, i.e., we consider the problem i...
متن کاملThe Simplex Method
To understand how simplex solves a general linear programming problem, we need to know the answers to a number of questions: • How to determine if a minimum feasible solution has been found? • Which basic variable should become non-basic at a pivot step? • Which nonbasic variable is to enter the basis at a pivot step? • How to find an initial basic feasible solution to start simplex? We already...
متن کاملA regularized simplex method
In case of a special problem class, the simplex method can be implemented as a cutting-plane method that approximates a polyhedral convex objective function. In this paper we consider a regularized version of this cutting-plane method, and interpret the resulting procedure as a regularized simplex method. (Regularization is performed in the dual space and only affects the process through the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2003
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil0317169s